Transfer entropy rate through Lempel-Ziv complexity
نویسندگان
چکیده
منابع مشابه
Estimating the Entropy Rate of Spike Trains via Lempel-Ziv Complexity
Normalized Lempel-Ziv complexity, which measures the generation rate of new patterns along a digital sequence, is closely related to such important source properties as entropy and compression ratio, but, in contrast to these, it is a property of individual sequences. In this article, we propose to exploit this concept to estimate (or, at least, to bound from below) the entropy of neural discha...
متن کاملLempel-Ziv Dimension for Lempel-Ziv Compression
This paper describes the Lempel-Ziv dimension (Hausdorff like dimension inspired in the LZ78 parsing), its fundamental properties and relation with Hausdorff dimension. It is shown that in the case of individual infinite sequences, the Lempel-Ziv dimension matches with the asymptotical Lempel-Ziv compression ratio. This fact is used to describe results on Lempel-Ziv compression in terms of dime...
متن کاملProperties of maximum Lempel-Ziv complexity strings
The properties of maximum Lempel-Ziv complexity strings are studied for the binary case. A comparison between MLZs and random strings is carried out. The length profile of both type of sequences show different distribution functions. The non-stationary character of the MLZs are discussed. The issue of sensitiveness to noise is also addressed. An empirical ansatz is found that fits well to the L...
متن کاملLempel-Ziv Complexity of Photonic Quasicrystals
The properties of photonic quasicrystals ultimate rely on their inherent long-range order, a hallmark that can be quantified in many ways depending on the specific aspects to be studied. We use the Lempel-Ziv measure, a basic tool for information theoretic problems, to characterize the complexity of the specific structure under consideration. Using the generalized Fibonacci quasicrystals as our...
متن کاملOn Lempel-Ziv Complexity of Sequences
We derive recurrences for counting the number a(n, r) of sequences of length n with Lempel-Ziv complexity r, which has important applications, for instance testing randomness of binary sequences. We also give algorithms to compute these recurrences. We employed these algorithms to compute a(n, r) and expected value, EPn, of number of patterns of a sequence of length n, for relatively large n. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2020
ISSN: 2470-0045,2470-0053
DOI: 10.1103/physreve.101.052117